Fusion Multiple Kernel K-means

نویسندگان

چکیده

Multiple kernel clustering aims to seek an appropriate combination of base kernels mine inherent non-linear information for optimal clustering. Late fusion algorithms generate partitions independently and integrate them in the following procedure, improving overall efficiency. However, separate partition generation leads inadequate negotiation with procedure a great loss beneficial corresponding matrices, which negatively affects performance. To address this issue, we propose novel algorithm, termed as Fusion Kernel k-means (FMKKM), unifies learning late into one single objective function, adopts early technique capture more sufficient matrices. Specifically, helps keep details, further guides consensus stage, while provides positive feedback on two former procedures. The close collaboration three procedures results promising performance improvement. Subsequently, alternate optimization method convergence is developed solve resultant problem. Comprehensive experimental demonstrate that our proposed algorithm achieves state-of-the-art multiple public datasets, validating its effectiveness. code work publicly available at https://github.com/ethan-yizhang/Fusion-Multiple-Kernel-K-means.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Kernel Clustering: Approximate Kernel k-means

Kernel-based clustering algorithms have the ability to capture the non-linear structure in real world data. Among various kernel-based clustering algorithms, kernel k -means has gained popularity due to its simple iterative nature and ease of implementation. However, its run-time complexity and memory footprint increase quadratically in terms of the size of the data set, and hence, large data s...

متن کامل

Robust Multiple Kernel K-means Using L21-Norm

The k-means algorithm is one of the most often used method for data clustering. However, the standard k-means can only be applied in the original feature space. The kernel k-means, which extends k-means into the kernel space, can be used to capture the non-linear structure and identify arbitrarily shaped clusters. Since both the standard k-means and kernel k-means apply the squared error to mea...

متن کامل

Kernel Penalized K-means: A feature selection method based on Kernel K-means

Article history: Received 11 June 2014 Received in revised form 23 October 2014 Accepted 11 June 2015 Available online 19 June 2015

متن کامل

Scalable Kernel k-Means via Centroid Approximation

Although kernel k-means is central for clustering complex data such as images and texts by implicit feature space embedding, its practicality is limited by the quadratic computational complexity. In this paper, we present a novel technique based on scalable centroid approximation that accelerates kernel k-means down to a sub-quadratic complexity. We prove near-optimality of our algorithm, and e...

متن کامل

Localized Data Fusion for Kernel k-Means Clustering with Application to Cancer Biology

In many modern applications from, for example, bioinformatics and computer vision, samples have multiple feature representations coming from different data sources. Multiview learning algorithms try to exploit all these available information to obtain a better learner in such scenarios. In this paper, we propose a novel multiple kernel learning algorithm that extends kernel k-means clustering t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2022

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v36i8.20896